/*
 * @Date: 2021-09-11 09:15:34
 * @Author: Acckno1
 * @LastEditTime: 2021-09-11 09:25:11
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

struct Eged
{
    int a, b;
}e[N];
int n, m;
int color[N];

inline void solution() {
    cin >> n >> m;
    for (int i = 0; i < m; i ++ ) cin >> e[i].a >> e[i].b;
    
    int T;
    cin >> T;
    while (T -- ) {
        bool flag = true;
        unordered_set<int> st;
        for (int i = 0; i < n; i ++ ) {
            cin >> color[i];
            st.insert(color[i]);
        }
        for (int i = 0; i < m; i ++ ) {
            if (color[e[i].a] == color[e[i].b]) flag = false;
        }
        if (!flag) cout << "No\n";
        else if (st.size() != 0) cout << st.size() << "-coloring\n";
        else if (st.size() == 0) cout << "No\n";
    }
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}